Tusnady’s Lemma, 24 Years Later
نویسندگان
چکیده
– The optimal coupling between a variable with the Bin(n,1/2) distribution and a normal random variable lies at the heart of the proof of the KMT Theorem for the empirical distribution function. Tusnády’s Lemma (published in 1977 in his dissertation and in Hungarian) provides an inequality with explicit absolute constants which says that for this coupling, the distance between the random variables remains bounded in probability. In the appendix of a joint work with Jean Bretagnolle (1989), we have proposed a proof of Tusnády’s Lemma which though elementary is highly technical and considered as rather obscure, at least this is what we have understood from several conversations with motivated readers. The purpose of this paper is to provide an alternative proof which is still based on elementary computations but which we hope to be simpler and more illuminating. This new proof also leads to a slight improvement on the original result in terms of constants. 2002 Éditions scientifiques et médicales Elsevier SAS MSC: primary 60F17, 60F99; secondary 62G30
منابع مشابه
Tusnády’s Inequality Revisited
Tusnady’s inequality is the key ingredient in the KMT/Hungarian coupling of the empirical distribution function with a Brownian Bridge. We present an elementary proof of a result that sharpens the Tusnady inequality, modulo constants. Our method uses the beta integral representation of binomial tails, simple Taylor expansion, and some novel bounds for the ratios of normal tail probabilities. Ke...
متن کامل50 Years of Bailey’s Lemma
Half a century ago, The Proceedings of the London Mathematical Society published W. N. Bailey’s influential paper Identities of the Rogers–Ramanujan type [16]. The main result therein, which was inspired by Rogers’ second proof of the Rogers– Ramanujan identities [49] (and also [48, 28, 15]), is what is now known as Bailey’s lemma. To celebrate the occasion of the lemma’s fiftieth birthday we p...
متن کاملA note on kernels and Sperner's Lemma
The kernel-solvability of perfect graphs was first proved by Boros and Gurvich, and later Aharoni andHolzmangave a shorter proof. Bothproofswere based on Scarf’s Lemma. In this note we show that a very simple proof can be given using a polyhedral version of Sperner’s Lemma. In addition, we extend the Boros–Gurvich theorem to h-perfect graphs and to a more general setting. © 2009 Elsevier B.V. A...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کامل